Practical Issues in the Flattening of Nested Parallelism with Program Transformations (extended Abstract)
نویسندگان
چکیده
The \\attening" of nested data-parallelism reduces a very broad class of data-parallel expressions to parallel vector operations. The technique can be understood as the application of a small set of program transformations. In this paper, we explore several practical issues involved in the implementation of these transformations, with an emphasis on the production of optimized vector code.
منابع مشابه
2 Avoiding Code Explosion 2
The \\attening" of nested data-parallelism reduces a very broad class of data-parallel expressions to parallel vector operations. The technique can be understood as the application of a small set of program transformations. In this paper, we explore several practical issues involved in the implementation of these transformations, with an emphasis on the production of optimized vector code.
متن کاملWork-Efficient Nested Data-Parallelism†
An apply-to-all construct is the key mechanism for expressing data-parallelism, but data-parallel programming languages like HPF and C* significantly restrict which operations can appear in the construct. Allowing arbitrary operations substantially simplifies the expression of irregular and nested data-parallel computations. The technique of flattening nested parallelism introduced by Blelloch,...
متن کاملHigher order nested data parallelism: semantics and implementation
Nested data-parallel programming is an attractive approach to implementing applications for massively parallel systems. It allows complex parallel behaviour to be specified by combining and nesting operations on parallel collections and liberates the programmer from low-level concerns such as synchronisation and communication. The high degree of abstraction is achieved by transferring to the co...
متن کاملFunctional programming for nested data parallelism on GPUs
Recent advances in general purpose GPU computing technology allow new data parallel kernel jobs to be dispatched dynamically during kernel execution. This enables significantly more expressive programming using nested data parallelism (NDP), where the restrictive need for flat data structures and computation has been lifted. Functional programming is fundamentally well suited for expressing dat...
متن کاملA Calculational Approach to Flattening Nested Data Parallelism in Functional Languages
The data-parallel programming model is currently the most successful model for programming massively parallel computers. Unfortunately, it is, in its present form, restricted to exploitingflat data parallelism, which is not suitable for some classes of algorithms, e.g. those operating on irregular structures. Recently, some effort has been made to implement nested data-parallel programs efficie...
متن کامل